A Fast Method For Computing Principal Curvatures From Range Images

نویسندگان

  • Andrew Spek
  • Wai Ho Li
  • Tom Drummond
چکیده

Estimation of surface curvature from range data is important for a range of tasks in computer vision and robotics, object segmentation, object recognition and robotic grasping estimation. This work presents a fast method of robustly computing accurate metric principal curvature values from noisy point clouds which was implemented on GPU. In contrast to existing readily available solutions which first differentiate the surface to estimate surface normals and then differentiate these to obtain curvature, amplifying noise, our method iteratively fits parabolic quadric surface patches to the data. Additionally previous methods with a similar formulation use less robust techniques less applicable to a high noise sensor. We demonstrate that our method is fast and provides better curvature estimates than existing techniques. In particular we compare our method to several alternatives to demonstrate the improvement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate Measurement of Normal Vectors and Principal Curvatures of the Left Ventricle from MRI Data Using Variational Calculus

Normal vectors are of primary importance in reconstructing the surface of the left ventricle from MR images of the heart. They are fundamental for accurate measurement of wall thickness, which is a very important parameter in assessing ventricular function. In this work, we present a novel technique for computing accurate normal vectors. This technique is based on variational calculus. It expli...

متن کامل

Algorithms for Computing Curvatures from Range Data

This article presents a comparison of several methods for local estimation of normal direction, principal curvatures and principal directions, given a range image as input. Here we take a range image to be a set of points in 3D space; we also need a definition for neighbourhoods. All methods we compare are based on local approximation of the range image by an analytic surface or curves. Other a...

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

$L_1$-Biharmonic Hypersurfaces in Euclidean Spaces with Three Distinct Principal Curvatures

Chen's biharmonic conjecture is well-known and stays open: The only biharmonic submanifolds of Euclidean spaces are the minimal ones. In this paper, we consider an advanced version of the conjecture, replacing $Delta$ by its extension, $L_1$-operator ($L_1$-conjecture). The $L_1$-conjecture states that any $L_1$-biharmonic Euclidean hypersurface is 1-minimal. We prove that the $L_1$-conje...

متن کامل

تجزیه و تحلیل مولفه های اصلی صفات کیفیت داخلی تخم مرغ و برخی از صفات عملکردی مرغ‌های بومی آذربایجان

   One of the main problems of multiple-trait genetic evaluation in poultry breeding is high computing costs. Principal components analysis (PCA) is a method for reducing the number of traits in correlated trait analysis. The aim of the present study was to determine the most effective principal components (PCs) of internal egg quality and some performance traits of Azarbayjan native chickens. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1707.00385  شماره 

صفحات  -

تاریخ انتشار 2015